On bipartite graphs of diameter 3 and defect 2

We consider bipartite graphs of degree Δ≥2, diameter D=3, and defect 2 (having 2 vertices less than the bipartite Moore bound). Such graphs are called bipartite (Δ, 3, ?2) ‐graphs. We prove the uniqueness of the known bipartite (3, 3, ?2) ‐graph and bipartite (4, 3, ?2)‐graph. We also prove several necessary conditions for the existence of bipartite (Δ, 3, ?2) ‐graphs. The most general of these conditions is that either Δ or Δ?2 must be a perfect square. Furthermore, in some cases for which the condition holds, in particular, when Δ=6 and Δ=9, we prove the non‐existence of the corresponding bipartite (Δ, 3, ?2)‐graphs, thus establishing that there are no bipartite (Δ, 3, ?2)‐graphs, for 5≤Δ≤10. © 2009 Wiley Periodicals, Inc. J Graph Theory 61: 271–288, 2009     

具有脉冲收获的捕食系统的周期解

考虑了一类具有阶段结构和脉冲收获的捕食模型.讨论了解的非负性和有界性.利用重合度定理,得到了正周期解存在的充分条件.     

一类具有脉冲和非单调功能反应的捕食者-食饵系统的多重正周期解

研究了一类具有脉冲和非单调功能反应的捕食系统,利用重合度理论中的延拓定理,获得了该系统至少存在两个正周期解的充分条件.     

模糊关系的模糊度的一般形式

研究了模糊关系的模糊度的一般表示形式问题,得到了关于模糊关系模糊度的一系列定理及公式,丰富了模糊度的内容.     

具偏差变元的高阶泛函微分方程的周期解存在性问题

利用Fourier级数理论,伯努利数理论和重合度理论研究了一类具偏差变元的高阶泛函微分方程x(m)(t)+(m-1)∑(i=1)aix(i)(t)+f(x(t))+β(t)g(x(t-T(t)))=p(t)的周期解问题,得到了周期解存在的充分条件,有意义的是函数β(t)可变号.     

A Simple Method for Controlling the Degree of PEGylation of Dynorphin A (1-13)

Dynorphin A (1–13) was chemically modified by reaction with succinimidyl propionate‐monomethoxy polyethylene glycol (mPEG‐SPA). To determine the degree and the optimized condition for PEGylation of dynorphin A, the reactions were monitored in different pH buffers at different molar ratios by reversed‐phase high performance liquid chromatography (RP‐HPLC) and matrix‐assisted laser desorption/ionization time‐of‐?ight mass spectrometry (MALDI‐TOF MS). The results showed that the degree of PEGylation for dynorphin A could easily be controlled through adjustment of the molar ratios and the pH. The degree of PEGylation of dynorphin A increased as the molar ratio of dynorphin to MPEG‐SPA and the pH increased.     

Rainbow matchings in Dirac bipartite graphs

We show the existence of rainbow perfect matchings in μn‐bounded edge colorings of Dirac bipartite graphs, for a sufficiently small μ > 0. As an application of our results, we obtain several results on the existence of rainbow k‐factors in Dirac graphs and rainbow spanning subgraphs of bounded maximum degree on graphs with large minimum degree.     

Asymmetry and structural information in preferential attachment graphs

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd?s‐Rényi graphs are typically asymmetric, real networks are highly symmetric. So a natural question is whether preferential attachment graphs, where in each step a new node with m edges is added, exhibit any symmetry. In recent work it was proved that preferential attachment graphs are symmetric for m = 1, and there is some nonnegligible probability of symmetry for m = 2. It was conjectured that these graphs are asymmetric when m ≥ 3. We settle this conjecture in the affirmative, then use it to estimate the structural entropy of the model. To do this, we also give bounds on the number of ways that the given graph structure could have arisen by preferential attachment. These results have further implications for information theoretic problems of interest on preferential attachment graphs.     

利他偏好下供应链效率和公平度动态演进研究

根据零售商利他偏好信息非对称性和动态演进特征,将零供博弈信息结构分为4个演进过程,采用逆向归纳法求解各个过程中供应链主观效率和客观效率、以"公平熵"计算供应链主观公平度和客观公平度,从主观与客观2个维度分析供应链利他偏好行为对供应链效率和公平度动态演进的影响.通过对比分析得出:信息对称下零售商利他偏好行为不改变供应链利润但会改变各个成员在供应链中的利润分配比例,起到"供应链利润分配机制"的作用;供应链主观效率总是不低于客观效率,供应链主观公平度总是不低于客观公平度;从主观评价供应链能够实现协调且供应链能够兼顾效率和公平.     

基于品牌手机未来销量预测

本文是用灰色预测GM（1,1）模型,探讨了手机销售总数量动态变化,为手机生产提供参考。同时用灰色关联度,来计算总销售量对需要预测的品牌影响,以关联度作为权重,来预测目标品牌。结果表明,对手机销售数量的历史趋势拟合程度较高,所以用此预测模型预测,具有一定的参考价值。